计算机应用

• 人工智能与仿真 •    下一篇

基于分层自主学习的改进粒子群算法

袁小平1,蒋硕2   

  1. 1. 江苏徐州中国矿业大学信电学院
    2. 中国矿业大学
  • 收稿日期:2018-06-27 修回日期:2018-08-05 发布日期:2018-09-28 出版日期:2018-09-28
  • 通讯作者: 蒋硕

Research on improved particle swarm optimization based on hierarchical autonomous learning

  • Received:2018-06-27 Revised:2018-08-05 Online:2018-09-28 Published:2018-09-28

摘要: 摘 要: 针对粒子群优化(PSO)算法容易陷入局部最优,收敛精度不高,收敛速度较慢的问题,提出一种基于分层自主学习的改进粒子群优化(HCPSO)算法。首先,根据粒子适应度值和迭代次数将种群动态的划分为三个不同阶层;然后,根据不同阶层粒子特性,分别采用局部学习模型、标准学习模型以及全局学习模型,增加粒子多样性,反映出个体差异的认知对算法性能的影响,提高算法的收敛速度和收敛精度;最后,将HCPSO算法与其他三种对比算法分别在6个典型的测试函数上进行对比仿真实验,仿真结果表明,HCPSO算法的收敛速度和收敛精度均有明显提升,并且算法执行时间和基本PSO算法执行时间差距在0.001量级内,在不增加算法复杂度的情况下提高算法性能。

Abstract: Abstract: Focused on the issue that the particle swarm optimization algorithm was prone to fall into the local optimal, the convergence accuracy was not high, and the convergence speed was slow, an improved particle swarm optimization algorithm based on hierarchical autonomous learning was proposed. Firstly, according to the particle fitness value and the number of iterations, the population was dynamically divided into three different classes. Then, according to the characteristics of different classes of particles, the local learning model, the standard learning model and the global learning model were respectively adopted to increase the particle diversity and reflect the effect of individual difference cognition on the performance of the algorithm, improved convergence speed and convergence precision of the algorithm. Finally, the HCPSO algorithm and the other three contrast algorithms were compared on 6 typical test functions respectively. The simulation results show that the convergence speed and convergence accuracy of the HCPSO algorithm were obviously improved, and the execution time of the algorithm and the time difference of the basic PSO algorithm were poor within 0.001 orders of magnitude. The algorithm performance was improved without increasing the complexity of the algorithm.

中图分类号: